Evolving generalized Voronoi diagrams for accurate cellular image segmentation
نویسندگان
چکیده
منابع مشابه
Generalized Voronoi Tessellations for Vector-Valued Image Segmentation
We address the issue of low-level segmentation for vectorvalued images, focusing on color images. The proposed approach relies on the formulation of the problem as a generalized Voronoi tessellation of the image domain. In this context, the issue is transferred to the definition of an appropriated pseudo-metric and the selection of a set of sources. Two types of pseudo-metrics are considered; t...
متن کاملVisualization of Generalized Voronoi Diagrams
Voronoi diagrams are an important data structure in computer science. However well studied mathematically, understanding such diagrams for different metrics, orders, and site shapes is a complex task. We propose a new method to visualize k-order diagrams and give an efficient adaptive implementation for this method. The algorithm is easy to customize for different metrics and site shapes. Its r...
متن کاملImage Processing using Voronoi diagrams
1 This work has been partially supported by grant TIN2005-08863-C03 of the Spanish Ministry of Science and Education 2 Corresponding address: [email protected] Abstract – In this paper we present some techniques for obtaining non-photorealistc images with the aid of Voronoi diagrams, such as stained-glass images. We also show examples of their potential applications, including lossy image ...
متن کاملApproximations of 3D generalized Voronoi diagrams
We introduce a new approach to approximate generalized 3D Voronoi diagrams for different site shapes (points, spheres, segments, lines, polyhedra, etc) and different distance functions (Euclidean metrics, convex distance functions, etc). The approach is based on an octree data structure denoted Voronoi-Octree (VO) that encodes the information required to generate a polyhedral approximation of t...
متن کاملGeneralized Voronoi Diagrams on Polyhedral Terrains
We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cytometry Part A
سال: 2010
ISSN: 1552-4922,1552-4930
DOI: 10.1002/cyto.a.20876